منابع مشابه
Taylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملThe Entropy of a Binary Hidden Markov Process
The entropy of a binary symmetric Hidden Markov Process is calculated as an expansion in the noise parameter ǫ. We map the problem onto a one-dimensional Ising model in a large field of random signs and calculate the expansion coefficients up to second order in ǫ. Using a conjecture we extend the calculation to 11th order and discuss the convergence of the resulting series.
متن کاملthe impact of portfolio assessment on iranian efl students essay writing: a process-oriented approach
this study was conducted to investigate the impact of portfolio assessment as a process-oriented assessment mechanism on iranian efl students’ english writing and its subskills of focus, elaboration, organization, conventions, and vocabulary. out of ninety juniors majoring in english literature and translation at the university of isfahan, sixty one of them who were at the same level of writing...
15 صفحه اولRelative Entropy Rate between a Markov Chain and Its Corresponding Hidden Markov Chain
In this paper we study the relative entropy rate between a homogeneous Markov chain and a hidden Markov chain defined by observing the output of a discrete stochastic channel whose input is the finite state space homogeneous stationary Markov chain. For this purpose, we obtain the relative entropy between two finite subsequences of above mentioned chains with the help of the definition of...
متن کاملThe Entropy Rate of the Hidden Markov Process
A stochastic process which is a noisy observation of a Markov process through a memoryless channel is called a hidden Markov process (HMP). Finding the entropy rate of HMP is motivated by applications in both stochastic signal processing and information theory. The first expression for the entropy rate of HMP is found in 1957 [1]. This expression is defined through a measure described by an int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.01.012